High-Level Synthesis of Shared-Bus Systems from Data-Flow Graphs
نویسنده
چکیده
A shared-bus system consists of multiple buses shared by multiple functional units. Two important problems involved in the high-level synthesis of such a system are: the scheduling problem and the resource allocation problem for a given data-flow graph (DFG). This paper proposes methods to optimally solve these two problems. The proposed methods are applicable to both non-iterative DFGs and iterative DFGs with non-unitary communication and computation times. To solve the scheduling problem, we introduce the extended DFG so that both computations and communications can be scheduled simultaneously to functional units and interconnection buses in a single integer linear programming formulation. To solve the resource allocation problem, we apply techniques of integer linear programming, circular-arc coloring, and channel assignment.
منابع مشابه
Timed Dependence Flow Graphs, an Intermediate Form for Veri ed High-level Synthesis
{We present timed dependence ow graphs, an intermediate form for high-level synthesis from speciications written in behavioral hardware description languages. Timed dependence ow graphs express data, control, resource access, and timing dependences, and can be constructed in linear time from behavioral VHDL descriptions. We also present a formal execution semantics for timed dependence ow graph...
متن کاملAn efficient CAD tool for High-Level Synthesis of VLSI digital transformers
Digital transformers are considered as one of the digital circuits being widely used in signal and data processing systems, audio and video processing, medical signal processing as well as telecommunication systems. Transforms such as Discrete Cosine Transform (DCT), Discrete Wavelet Transform (DWT) and Fast Fourier Transform (FFT) are among the ones being commonly used in this area. As an illu...
متن کاملTimed Dependence Flow Graphs , an Intermediate Formfor
We present timed dependence ow graphs, an intermediate form for high-level synthesis from speciica-tions written in behavioral hardware description languages. Timed dependence ow graphs express data, control, resource access, and timing dependences, and can be constructed in linear time from behavioral VHDL descriptions. We also present a formal execution semantics for timed dependence ow graph...
متن کاملDesign and Simulation of a Data-Flow Multiprocessor System
A data-flow execution model that supports program reentrancy, recursion, and automatic run-time loop unraveling without the use of tagged tokens is described. This execution model is based on a novel data-flow program graph representation scheme which is a hybrid of static and dynamic data-flow program representation methods. In particular, the use of separate instruction and data token spaces ...
متن کاملPerforming High-Level Synthesis via Program Transformations within a Theorem Prover
In this paper, we present a new methodology towards performing high-level synthesis. During high-level synthesis an algorithmic description is mapped to a structure of hardware components. In our approach, high-level synthesis is performed via program transformations. All transformations are performed within a higher order logic theorem prover thus guaranteeing correctness. Our approach is not ...
متن کامل